Models of Computation External Memory, Cache-Oblivious, and Multi-Core Algorithms
ثبت نشده
چکیده
1 External Memory Algorithms 2 1.1 Surveys and Books . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Own Papers on the Subject . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 The Memory Hierarchy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.4 The Parallel Disk Model of Aggarwal/Vitter . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.5 An External Memory Stack . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.5.1 A First Solution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.5.2 A Good Solution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.6 STXXL: Standard Template Library for Extra Large Data Sets . . . . . . . . . . . . . . . 4 1.7 Disk Striping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.8 Sorting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.8.1 Merge Sort . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.8.2 A Lower Bound . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.8.3 Sorting by Distribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.8.4 Optimal Sorting Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.9 PRAM-Simulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.9.1 List Ranking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.9.2 A General Simulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 1.9.3 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.10 BFS and DFS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.10.1 Naive BFS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.10.2 Munagala and Ranade . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 1.10.3 Mehlhorn and Meyer . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 1.10.4 Experimental Comparison . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 1.10.5 Lower Bounds . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 1.10.6 DFS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 1.11 Other Graph Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
منابع مشابه
Funnel Heap - A Cache Oblivious Priority Queue
The cache oblivious model of computation is a two-level memory model with the assumption that the parameters of the model are unknown to the algorithms. A consequence of this assumption is that an algorithm efficient in the cache oblivious model is automatically efficient in a multi-level memory model. Arge et al. recently presented the first optimal cache oblivious priority queue, and demonstr...
متن کاملCache-Oblivious Algorithms and Data Structures
Frigo, Leiserson, Prokop and Ramachandran in 1999 introduced the ideal-cache model as a formal model of computation for developing algorithms in environments with multiple levels of caching, and coined the terminology of cache-oblivious algorithms. Cache-oblivious algorithms are described as standard RAM algorithms with only one memory level, i.e. without any knowledge about memory hierarchies,...
متن کاملBrief Announcement : The Cache - Oblivious Gaussian Elimination Paradigm — Theoretical Framework and Experimental Evaluation ∗
Cache-efficient algorithms improve execution time by exploiting data parallelism inherent in the transfer of blocks of useful data between adjacent memory levels. By increasing locality in their memory access patterns, these algorithms try to keep the number of block transfers small. The cache-oblivious model [1] is a further refinement that enables the development of system-independent cache-e...
متن کاملAn Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem
In recent years the Cache-Oblivious model of external memory computation has provided an attractive theoretical basis for the analysis of algorithms on massive datasets. Much progress has been made in discovering algorithms that are asymptotically optimal or near optimal. However, to date there are still relatively few successful experimental studies. In this paper we compare two different Cach...
متن کاملGraph Algorithms for Multicores with Multilevel Caches
Historically, the primary model of computation employed in the design and analysis of algorithms has been the sequential RAM model. However, recent developments in computer architecture have reduced the efficacy of the sequential RAM model for algorithmic development. In response, theoretical computer scientists have developed models of computation which better reflect these modern architecture...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011